A general matrix iterative model for dynamic load balancing
نویسندگان
چکیده
منابع مشابه
A General Matrix Iterative Model for Dynamic Load Balancing
Effective load balancing algorithms are crucial in fully realizing the performance potential of parallel computer systems. This paper proposes a general matrix iterative model to represent a range of dynamic load balancing algorithms. The model and associated performance measures are used to evaluate and compare vairous load balancing algorithms and derive optimal algorithms and associated para...
متن کاملIterative Dynamic Load Balancing in Multicomputers
Dynamic load balancing in multicomputers can improve the utilization of processors and the eeciency of parallel computations through migrating workload across processors at runtime. We present a survey and critique of dynamic load balancing strategies that are iterative: workload migration is carried out through transferring processes across nearest neighbor processors. Iterative strategies hav...
متن کاملDistributed Dynamic Load Balancing for Iterative-Stencil Applications
In the context of jobs executed on heterogeneous clusters or Grids, load balancing is essential. Indeed, a slow machine must receive less work than a faster one otherwise the overall job termination will be delayed. This is particularly true for Iterative-Stencil Applications where tasks are run simultaneously and are interdependent. The problem of assigning coexisting tasks to machines is call...
متن کاملA repartitioning hypergraph model for dynamic load balancing
In parallel adaptive applications, the computational structure of the applications changes over time, leading to load imbalances even though the initial load distributions were balanced. To restore balance and to keep communication volume low in further iterations of the applications, dynamic load balancing (repartitioning) of the changed computational structure is required. Repartitioning diff...
متن کاملIterative algorithms for distributed load balancing
We consider the load balancing problem for a synchronous distributed processor network. The processor network is modeled by an undirected, connected graph G = (V;E) in which node vi 2 V possesses a computational load ui. We want to determine a schedule in order to move load across edges so that the weight on each node is approximately equal. This problem models load balancing when we associate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 1996
ISSN: 0167-8191
DOI: 10.1016/0167-8191(96)00026-9